Communication complexity

Results: 253



#Item
21Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11.

Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11.

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2014-04-12 03:40:34
22doi:Communication Costs of Strassen’s Matrix Multiplication By Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz

doi:Communication Costs of Strassen’s Matrix Multiplication By Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:30:47
23Reali, F., Chater, N. & Christiansen, M.HThe paradox of linguistic complexity and community size. In E.A. Cartmill, S. Roberts, H. Lyn & H. Cornish (Eds.), The evolution of language: Proceedings of the 10th Int

Reali, F., Chater, N. & Christiansen, M.HThe paradox of linguistic complexity and community size. In E.A. Cartmill, S. Roberts, H. Lyn & H. Cornish (Eds.), The evolution of language: Proceedings of the 10th Int

Add to Reading List

Source URL: cnl.psych.cornell.edu

Language: English - Date: 2014-05-13 21:32:42
24Identification of Haptic Virtual Objects with Different Degrees of Complexity Gunnar Jansson and Karin Larsson Department of Psychology, Uppsala University ;  Abstract

Identification of Haptic Virtual Objects with Different Degrees of Complexity Gunnar Jansson and Karin Larsson Department of Psychology, Uppsala University ; Abstract

Add to Reading List

Source URL: www.eurohaptics.vision.ee.ethz.ch

Language: English - Date: 2002-06-10 04:58:34
25Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
26Limitations of Quantum Advice and One-Way Communication

Limitations of Quantum Advice and One-Way Communication

Add to Reading List

Source URL: theoryofcomputing.org

Language: English - Date: 2014-11-14 13:01:57
27The	
  Complexity	
  of	
  Quantum	
   Entanglement	
   Fernando	
  G.S.L.	
  Brandão ETH	
  Zürich	
   	
  

The  Complexity  of  Quantum   Entanglement   Fernando  G.S.L.  Brandão ETH  Zürich    

Add to Reading List

Source URL: fernandobrandao.org

Language: English - Date: 2016-01-02 18:42:47
28The Unicist Research Institute Pioneers in Complexity Science Research since 1976 40th Anniversary

The Unicist Research Institute Pioneers in Complexity Science Research since 1976 40th Anniversary

Add to Reading List

Source URL: www.unicist.org

Language: English - Date: 2016-08-05 10:31:47
29CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015

CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-09-14 17:18:05
30Low-complexity secret key distribution for Vehicular Networks Jo˜ao Almeida∗ , Saurabh Shintre∗† , Mate Boban∗† , and Jo˜ao Barros∗ ∗  Instituto de Telecomunicac¸o˜ es, Departamento de Engenharia Electr

Low-complexity secret key distribution for Vehicular Networks Jo˜ao Almeida∗ , Saurabh Shintre∗† , Mate Boban∗† , and Jo˜ao Barros∗ ∗ Instituto de Telecomunicac¸o˜ es, Departamento de Engenharia Electr

Add to Reading List

Source URL: mateboban.net

Language: English - Date: 2013-07-15 15:53:05